Fetzer and Cristian : a Highly Available Local Leader
نویسندگان
چکیده
| We deene the highly available local leader election problem, a generalization of the leader election problem for partitionable systems. We propose a protocol that solves the problem eeciently and give some performance measurements of our implementation. The local leader election service has been proven useful in the design and implementation of several fail-aware services for partitionable systems.
منابع مشابه
A Highly Available Local Leader Election Service
We define the highly available local leader election problem, a generalization of the leader election problem for partitionable systems. We propose a protocol that solves the problem efficiently and give some performance measurements of our implementation. The local leader election service has been proven useful in the design and implementation of several fail-aware services for partitionable s...
متن کاملCristian and Fetzer : the Timed Asynchronous Distributed System Model
| We propose a formal deenition for the timed asyn-chronous distributed system model. We present extensive measurements of actual message and process scheduling delays and hardware clock drifts. These measurements connrm that this model adequately describes current distributed systems such as a network of workstations. We also give an explanation of why practically needed services, such as cons...
متن کاملFail-Aware Clock Synchronization
Internal clock synchronization requires that at any point in time the deviation between any two correct clocks is bounded by an a priori given constant. Due to network partitions, unbounded message transmission and process scheduling delays, internal clock synchronization is impossible to implement in asynchronous systems. We address this problem by proposing a new kind of clock synchronization...
متن کاملLower Bounds for Function Based Clock Synchronization
We assume that each process has access to a local hardware clock and that the drift of correct hardware clocks is bounded by a given constant . Since we are in this paper only interested in internal clock synchronization algorithms capable of masking arbitrary failures, when we talk about a synchronization algorithm, we mean an internal clock synchronization algorithm tolerant of arbitrary fail...
متن کاملApproximate Real-Time Clocks for Scheduled Events
This paper presents a simple protocol that provides application processes with an approximate real-time notion. This time notion is very versatile. At one extreme, it behaves at least as virtual time (being thereby consistent with causality). At the other extreme, it behaves as real-time. More precisely, with respect to approximate real-time all scheduled events are always executed at their sch...
متن کامل